On Odd Cuts and Plane Multicommodity
نویسنده
چکیده
Let T be an even subset of the vertices of a graph G. A T-cut is an edge-cutset of the graph which divides T into two odd sets. We prove that if G is bipartite, then the maximum number of disjoint !T-cuts is equal to the minimum cardinality of a set of edges which meets every T-cut. (A weaker form of this was proved by Edmonds and Johnson.) We deduce a solution to the real-valued multi-commodity flow problem for a class of planar graphs; and we also solve the integral 2-commodity flow problem for the same class of graphs, by a further analysis of the T-cut problem when|T| = 4.
منابع مشابه
Undirected distances and the postman-structure of graphs
We present some properties of the distance function and of shortest paths in + l-weighted undirected graphs. These extend some basic results, e.g., on matchings, on the Chinese postman problem, and on plane multicommodity flows. Furthermore, distances turn out to be efficient tools to generalize the matching-structure of graphs to a structure related to subgraphs having only parity constraints ...
متن کاملDistances and cuts in planar graphs
We prove the following theorem. Let G = (V, E) be a planar bipartite graph, embedded in the etrclidean plane. Let 0 and I be two of its faces. Then there exist pairwise edge-disjoint cuts C,, . . . . C, so that for each two vertices u, w with U, w E 0 or V, WE I, the distance from u to w in G is equal to the number of cuts C, separating u and w. This theorem is dual to a theorem of Okamura on p...
متن کامل0 61 7 - 19 90
We consider the maximum integral tWo-Commodity flow problem in augmented planar graphs (i.e., with both source-sink edges added) and provide an o(IVI 2 1ogIVI) algorithm for that problem. Let G = (V, E) be a graph and w : E-t Z+ a weight function. Let T C V be an even subset of the vertices of G. A T-cut is an edge-cutset of the graph which divides T into two odd sets. Lomonosov gave a good cha...
متن کاملApproximate duality of multicommodity multiroute flows and cuts: single source case
Given an integer h, a graph G = (V,E) with arbitrary positive edge capacities and k pairs of vertices (s1, t1), (s2, t2), . . . , (sk, tk), called terminals, an h-route cut is a set F ⊆ E of edges such that after the removal of the edges in F no pair si−ti is connected by h edge-disjoint paths (i.e., the connectivity of every si− ti pair is at most h− 1 in (V,E\F )). The h-route cut is a natura...
متن کاملGraph Coloring Facets from All-Different Systems
We explore the idea of obtaining valid inequalities for a 0-1 model from a constraint programming formulation of the problem. In particular, we formulate a graph coloring problem as a system of alldifferent constraints. By analyzing the polyhedral structure of alldiff systems, we obtain facet-defining inequalities that can be mapped to valid cuts in the classical 0-1 model of the problem. We fo...
متن کامل